Strong Convergence of an Implicit Iteration Algorithm for a Finite Family of Pseudocontractive Mappings

where E∗ denotes the dual space of E and 〈·, ·〉 denotes the generalized duality pairing. If E∗ is strictly convex, then J is single valued. In the sequel, we will denote the single-value duality mapping by j. Let C be a nonempty closed convex subset of E. Recall that a self-mapping f : C → C is said to be a contraction if there exists a constant δ ∈ 0, 1 such that ∥f x − f y ∥∥ ≤ δ‖x − y‖, ∀x, y ∈ C. 1.2